polynomial irreducibility - перевод на русский
Diclib.com
Словарь ChatGPT
Введите слово или словосочетание на любом языке 👆
Язык:

Перевод и анализ слов искусственным интеллектом ChatGPT

На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:

  • как употребляется слово
  • частота употребления
  • используется оно чаще в устной или письменной речи
  • варианты перевода слова
  • примеры употребления (несколько фраз с переводом)
  • этимология

polynomial irreducibility - перевод на русский

THEOREM
Eisenstein polynomial; Eisenstein criterion; Eisenstein's Irreducibility Criterion; Eisenstein's irreducibility criterion; Eisenstein irreducibility criterion; Schönemann-Eisenstein theorem; Schönemann–Eisenstein theorem; Eisenstein Criterion

polynomial irreducibility      

математика

неприводимость многочленов

reducible polynomial         
IRREDUCIBLE ELEMENT IN THE RING OF POLYNOMIALS; A NON-CONSTANT POLYNOMIAL THAT IS NOT THE PRODUCT OF TWO NON-CONSTANT POLYNOMIALS
Prime polynomial; Reducible polynomial; Algorithms for factoring polynomials

математика

приводимый многочлен

irreducible polynomial         
IRREDUCIBLE ELEMENT IN THE RING OF POLYNOMIALS; A NON-CONSTANT POLYNOMIAL THAT IS NOT THE PRODUCT OF TWO NON-CONSTANT POLYNOMIALS
Prime polynomial; Reducible polynomial; Algorithms for factoring polynomials

общая лексика

неприводимый многочлен

неприводимый полином

Определение

Polynomial
·adj Containing many names or terms; multinominal; as, the polynomial theorem.
II. Polynomial ·noun An expression composed of two or more terms, connected by the signs plus or minus; as, a2 - 2ab + b2.
III. Polynomial ·adj Consisting of two or more words; having names consisting of two or more words; as, a polynomial name; polynomial nomenclature.

Википедия

Eisenstein's criterion

In mathematics, Eisenstein's criterion gives a sufficient condition for a polynomial with integer coefficients to be irreducible over the rational numbers – that is, for it to not be factorizable into the product of non-constant polynomials with rational coefficients.

This criterion is not applicable to all polynomials with integer coefficients that are irreducible over the rational numbers, but it does allow in certain important cases for irreducibility to be proved with very little effort. It may apply either directly or after transformation of the original polynomial.

This criterion is named after Gotthold Eisenstein. In the early 20th century, it was also known as the Schönemann–Eisenstein theorem because Theodor Schönemann was the first to publish it.

Как переводится polynomial irreducibility на Русский язык